例句與造句

1. The Church-Turing thesis states that the two notions coincide : any number-theoretic function that is effectively calculable is recursively computable.
2. Originally introduced into Ambisonic use by Daniel, he notes : " " High degree of generality-the encoding coefficients are recursively computable, and the first-order components are unity vectors in their respective directions of incidence " ".
3. It's difficult to find recursively computable in a sentence. 用recursively computable造句挺難的